230 research outputs found

    Some power of an element in a Garside group is conjugate to a periodically geodesic element

    Full text link
    We show that for each element gg of a Garside group, there exists a positive integer mm such that gmg^m is conjugate to a periodically geodesic element hh, an element with |h^n|_\D=|n|\cdot|h|_\D for all integers nn, where |g|_\D denotes the shortest word length of gg with respect to the set \D of simple elements. We also show that there is a finite-time algorithm that computes, given an element of a Garside group, its stable super summit set.Comment: Subj-class of this paper should be Geometric Topology; Version published by BLM

    Periodic elements in Garside groups

    Get PDF
    Let GG be a Garside group with Garside element Ξ”\Delta, and let Ξ”m\Delta^m be the minimal positive central power of Ξ”\Delta. An element g∈Gg\in G is said to be 'periodic' if some power of it is a power of Ξ”\Delta. In this paper, we study periodic elements in Garside groups and their conjugacy classes. We show that the periodicity of an element does not depend on the choice of a particular Garside structure if and only if the center of GG is cyclic; if gk=Ξ”kag^k=\Delta^{ka} for some nonzero integer kk, then gg is conjugate to Ξ”a\Delta^a; every finite subgroup of the quotient group G/G/ is cyclic. By a classical theorem of Brouwer, Ker\'ekj\'art\'o and Eilenberg, an nn-braid is periodic if and only if it is conjugate to a power of one of two specific roots of Ξ”2\Delta^2. We generalize this to Garside groups by showing that every periodic element is conjugate to a power of a root of Ξ”m\Delta^m. We introduce the notions of slimness and precentrality for periodic elements, and show that the super summit set of a slim, precentral periodic element is closed under any partial cycling. For the conjugacy problem, we may assume the slimness without loss of generality. For the Artin groups of type AnA_n, BnB_n, DnD_n, I2(e)I_2(e) and the braid group of the complex reflection group of type (e,e,n)(e,e,n), endowed with the dual Garside structure, we may further assume the precentrality.Comment: The contents of the 8-page paper "Notes on periodic elements of Garside groups" (arXiv:0808.0308) have been subsumed into this version. 27 page

    Braid groups of imprimitive complex reflection groups

    Full text link
    We obtain new presentations for the imprimitive complex reflection groups of type (de,e,r)(de,e,r) and their braid groups B(de,e,r)B(de,e,r) for d,rβ‰₯2d,r \ge 2. Diagrams for these presentations are proposed. The presentations have much in common with Coxeter presentations of real reflection groups. They are positive and homogeneous, and give rise to quasi-Garside structures. Diagram automorphisms correspond to group automorphisms. The new presentation shows how the braid group B(de,e,r)B(de,e,r) is a semidirect product of the braid group of affine type A~rβˆ’1\widetilde A_{r-1} and an infinite cyclic group. Elements of B(de,e,r)B(de,e,r) are visualized as geometric braids on r+1r+1 strings whose first string is pure and whose winding number is a multiple of ee. We classify periodic elements, and show that the roots are unique up to conjugacy and that the braid group B(de,e,r)B(de,e,r) is strongly translation discrete.Comment: published versio

    An upper bound of the minimal asymptotic translation length of right-angled Artin groups on extension graphs

    Full text link
    For the right-angled Artin group action on the extension graph, it is known that the minimal asymptotic translation length is bounded above by 2 provided that the defining graph has diameter at least 3. In this paper, we show that the same result holds without any assumption. This is done by exploring some graph theoretic properties of biconnected graphs, i.e. connected graphs whose complement is also connected
    • …
    corecore